Approximate Model Checking Using a Subset of First-order Logic

A Logic for Approximate First-Order Reasoning

In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the first-order case is only semi-decidable. Even in the restricted case of finite universes of discourse, reasoning remains inherently intractable, as the reasoner has to deal with two independent sources of complexity: unbounded c...

First-Order LTL Model Checking Using MDGs

In this paper, we describe a first-order linear time temporal logic (LTL) model checker based on multiway decision graphs (MDG). We developed a first-order temporal language, LMDG∗, which expresses a subset of many-sorted first-order LTL and extends an earlier language, LMDG , defined for an MDG based abstract CTL model checking. We derived a set of rules, enabling the transformation of LMDG∗ f...

Model-Checking First-Order Logic: Automata and Locality

Flexible Static Semantic Checking Using First-Order Logic

Static analysis of software processes is important in assessing the correctness of processes, particularly since their long duration and distributed execution make them difficult to test. We describe a novel approach to building a static analyzer that can detect programming errors and anomalies in processes written in Little-JIL. We describe semantic rules declaratively in first-order logic and...

Static Contract Checking via First-Order Logic

We enrich the static semantics of Haskell in order to give stronger static guarantees about the input/output behavior of programs. Our approach has two parts: a contract system for Haskell, and a novel strategy for statically checking that a term satisfies a contract. The contract system includes refinement types, which refine Haskell types by arbitrary Boolean-valued Haskell expressions, and a...